- idUS
- Listar por autor
Listar por autor "Gauvrit, Nicolas"
Mostrando ítems 1-5 de 5
-
Artículo
Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines
Soler Toscano, Fernando; Zenil, Hector; Delahaye, Jean-Paul; Gauvrit, Nicolas (Public Library of Science, 2014)Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the ...
-
Artículo
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
Soler Toscano, Fernando; Zenil, Hector; Delahaye, Jean-Paul; Gauvrit, Nicolas (IOS Press, 2013)We show that real-value approximations of Kolmogorov-Chaitin complexity K(s) using the algorithmic coding theorem, as ...
-
Artículo
Human behavioral complexity peaks at age 25
Zenil, Hector; Soler Toscano, Fernando; Delahaye, Jean-Paul; Brugger, Peter; Gauvrit, Nicolas (Public Library of Science, 2017)Random Item Generation tasks (RIG) are commonly used to assess high cognitive abilities such as inhibition or sustained ...
-
Artículo
Natural scene statistics mediate the perception of image complexity
Gauvrit, Nicolas; Soler Toscano, Fernando; Zenil, Hector (Taylor & Francis, 2014)Humans are sensitive to complexity and regularity in patterns (Falk & Konold, 1997; Yamada, Kawabe, & Miyazaki, 2013). The ...
-
Artículo
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
Zenil, Hector; Soler Toscano, Fernando; Delahaye, Jean-Paul; Gauvrit, Nicolas (PeerJ, 2015)We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a ...